Proper splittings and reduced solutions of matrix equations
نویسندگان
چکیده
In this article we apply proper splittings of matrices to develop an iterative process approximate solutions matrix equations the form TX=W. Moreover, by using partial order induced positive semidefinite matrices, obtain equivalent conditions convergence process. We also include some speed comparison results method. addition, for all T propose a splitting based on polar decomposition T.
منابع مشابه
Symmetrically reduced Galileon equations and solutions
The maximally complicated arbitrary-dimensional “maximal” Galileon field equations simplify dramatically for symmetric configurations. Thus, spherical symmetry reduces the equations from the D− to the two-dimensional Monge-Ampere equation, axial symmetry to its cubic extension etc. We can then obtain explicit solutions, such as spherical or axial waves, and relate them to the (known) general, b...
متن کاملEfficient Solutions of Coupled Matrix and Matrix Differential Equations
In Kronecker products works, matrices are some times regarded as vectors and vectors are some times made in to matrices. To be precise about these reshaping we use the vector and diagonal extraction operators. In the present paper, the results are organized in the following ways. First, we formulate the coupled matrix linear least-squares problem and present the efficient solutions of this prob...
متن کاملexistence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولFast verification of solutions of matrix equations
In this paper, we are concerned with a matrix equation Ax = b where A is an n× n real matrix and x and b are n-vectors. Assume that an approximate solution e x is given together with an approximate LU decomposition. We will present fast algorithms for proving nonsingularity of A and for calculating rigorous error bounds for ‖A−1b − e x‖∞. The emphasis is on rigour of the bounds. The purpose of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2022
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2021.125588